On balanced claw designs of complete multi-partite graphs
نویسندگان
چکیده
منابع مشابه
On Chromatic Uniqueness of Complete Complete 6-Partite Graphs
Let P (G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G ∼ H, if P (G,λ) = P (H,λ). We write [G] = {H|H ∼ G}. If [G] = {G}, then G is said to be chromatically unique. In this paper, we first characterize certain complete 6-partite graphs G with 6n + i vertices for i = 0, 1, 2 according to the number of 7-independent partitions o...
متن کاملOn Integral Complete R−partite Graphs
A graph G is called integral if all the eigenvalues of its adjacency matrix are integers. In this paper we investigate integral complete r−partite graphs Kp1,p2,...,pr = Ka1p1,a2p2,...,asps with s ≤ 4. New sufficient conditions for complete 3-partite graphs and complete 4-partite graphs to be integral are given. From these conditions we construct infinitely many new classes of integral complete...
متن کاملIntegral complete r-partite graphs
A graph is called integral if all the eigenvalues of its adjacency matrix are integers. In this paper, we give a useful sufficient and necessary condition for complete r-partite graphs to be integral, from which we can construct infinite many new classes of such integral graphs. It is proved that the problem of finding such integral graphs is equivalent to the problem of solving some Diophantin...
متن کاملSpanners of Complete k -Partite Geometric Graphs
We address the following problem: Given a complete k-partite geometric graph K whose vertex set is a set of n points in R, compute a spanner of K that has a “small” stretch factor and “few” edges. We present two algorithms for this problem. The first algorithm computes a (5 + )-spanner of K with O(n) edges in O(n log n) time. The second algorithm computes a (3 + )-spanner of K with O(n log n) e...
متن کاملGroup magicness of complete n-partite graphs
Let A be a non-trivial Abelian group. We call a graph G = (V, E) A-magic if there exists a labeling f : E → A∗ such that the induced vertex set labeling f : V → A, defined by f(v) = ∑ uv∈E f(uv) is a constant map. In this paper, we show that Kk1,k2,...,kn (ki ≥ 2) is A-magic, for all A where |A| ≥ 3.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1982
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90177-7